Finiteness of circulant weighing matrices of fixed weight
نویسندگان
چکیده
Let n be any fixed positive integer. Every circulant weighing matrix of weight n arises from what we call an irreducible orthogonal family of weight n. We show that the number of irreducible orthogonal families of weight n is finite and thus obtain a finite algorithm for classifying all circulant weighing matrices of weight n. We also show that, for every odd prime power q, there are at most finitely many proper circulant weighing matrices of weight q.
منابع مشابه
Adjacency matrices of polarity graphs and of other C4-free graphs of large size
Main talks 1. Simeon Ball, On subsets of a finite vector space in which every subset of basis size is a basis 2. Simon Blackburn, Honeycomb arrays 3. Gàbor Korchmàros, Curves over finite fields, an approach from finite geometry 4. Cheryl Praeger, Basic pregeometries 5. Bernhard Schmidt, Finiteness of circulant weighing matrices of fixed weight 6. Douglas Stinson, Multicollision attacks on itera...
متن کاملSome New Results on Circulant Weighing Matrices
We obtain a few structural theorems for circulant weighing matrices whose weight is the square of a prime number. Our results provide new schemes to search for these objects. We also establish the existence status of several previously open cases of circulant weighing matrices. More specifically we show their nonexistence for the parameter pairs (n, k) (here n is the order of the matrix and k i...
متن کاملThe Classification of Circulant Weighing Matrices of Weight 16 and Odd Order
In this paper we completely classify the circulant weighing matrices of weight 16 and odd order. It turns out that the order must be an odd multiple of either 21 or 31. Up to equivalence, there are two distinct matrices in CW (31, 16), one matrix in CW (21, 16) and another one in CW (63, 16) (not obtainable by Kronecker product from CW (21, 16)). The classification uses a multiplier existence t...
متن کاملOn circulant and two-circulant weighing matrices
We employ theoretical and computational techniques to construct new weighing matrices constructed from two circulants. In particular, we construct W (148, 144), W (152, 144), W (156, 144) which are listed as open in the second edition of the Handbook of Combinatorial Designs. We also fill a missing entry in Strassler’s table with answer ”YES”, by constructing a circulant weighing matrix of orde...
متن کاملA class of mutually inequivalent circulant weighing matrices
It is well-known that for each prime power q and for each d ∈ 2N, there exists a circulant weighing matrix of order q d+1−1 q−1 and weight q . We extend this result to show that there exist φ(d+1) 2 inequivalent circulant weighing matrices of order q d+1−1 q−1 and weight q , where φ is the Euler totient function. Further, we obtain a bound on the magnitude of the values taken by the cross-corre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 118 شماره
صفحات -
تاریخ انتشار 2011